Reasoning about Finite-State Switched Systems
نویسندگان
چکیده
A switched system is composed of components. The components do not interact with one another. Rather, they all interact with the same environment, which switches one of them on at each moment in time. In standard concurrency, a component restricts the environment of the other components, thus the concurrent system has fewer behaviors than its components. On the other hand, in a switched system, a component suggests an alternative to the other components, thus the switched system has richer behaviors than its components. We study finite-state switched systems, where each of the underlying components is a finite-state transducer. While the main challenge, namely compositionality, is similar in standard concurrent systems and in switched systems, the problems and solutions are different. In the verification front, we suggest and study an assumeguarantee paradigm for switched systems, and study formalisms in which satisfaction of a specification in all components imply its satisfaction in the switched system. In the synthesis front, we show that while compositional synthesis and design are undecidable, the problem of synthesizing a switching rule with which a given switched system satisfies an LTL specification is decidable.
منابع مشابه
A new approach based on state conversion to stability analysis and control design of switched nonlinear cascade systems
In this paper, the problems of control and stabilization of switched nonlinear cascade systems is investigated. The so called simultaneous domination limitation (SDL) is introduced in previous works to assure the existence of a common quadratic Lyapunov function (CQLF) for switched nonlinear cascade systems. According to this idea, if all subsystems of a switched system satisfy the SDL, a CQLF ...
متن کاملGeometry Design of Switched Reluctance Motor to Reduce the Torque Ripple by Finite Element Method and Sensitive Analysis.
متن کامل
A new switching strategy for exponential stabilization of uncertain discrete-time switched linear systems in guaranteed cost control problem
Uncertain switched linear systems are known as an important class of control systems. Performance of these systems is affected by uncertainties and its stabilization is a main concern of recent studies. Existing work on stabilization of these systems only provides asymptotical stabilization via designing switching strategy and state-feedback controller. In this paper, a new switching strate...
متن کاملDesign of Observer-based H∞ Controller for Robust Stabilization of Networked Systems Using Switched Lyapunov Functions
In this paper, H∞ controller is synthesized for networked systems subject to random transmission delays with known upper bound and different occurrence probabilities in the both of feedback (sensor to controller) and forward (controller to actuator) channels. A remote observer is employed to improve the performance of the system by computing non-delayed estimates of the sates. The closed-loop s...
متن کاملProbabilistic Program Equivalence for NetKAT
We study the problem of deciding program equivalence in the context of Probabilistic NetKAT, a formal language for reasoning about the behavior of packet-switched networks. We show that the problem is decidable for the history-free fragment of the language, and discuss a path toward a decision procedure for the full language. The main challenge lies in reasoning about iteration, which we addres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009